Neural network compute tile

ABSTRACT

A computing unit is disclosed, comprising a first memory bank for storing input activations and a second memory bank for storing parameters used in performing computations. The computing unit includes at least one cell comprising at least one multiply accumulate (“MAC”) operator that receives parameters from the second memory bank and performs computations. The computing unit further includes a first traversal unit that provides a control signal to the first memory bank to cause an input activation to be provided to a data bus accessible by the MAC operator. The computing unit performs one or more computations associated with at least one element of a data array, the one or more computations being performed by the MAC operator and comprising, in part, a multiply operation of the input activation received from the data bus and a parameter received from the second memory bank.

BACKGROUND

This specification generally relates to a neural net compute tile for computation of Deep Neural Networks (“DNN”) layers that allows for reduced instruction bandwidth and instruction memory.

SUMMARY

In general, one innovative aspect of the subject matter described in this specification can be embodied in a computing unit for accelerating tensor computations. The computing unit comprising a first memory bank having a first data width for storing at least one of input activations or output activations, and a second memory bank having a second data width that is larger than the first data width for storing one or more parameters used in performing computations. The computing unit may further include at least one cell comprising at least one multiply accumulate (“MAC”) operator that receives parameters from the second memory bank and performs computations. The computing unit may still further include a first traversal unit in data communication with at least the first memory bank, the first traversal unit configured to provide a control signal to the first memory bank to cause an input activation to be provided to a data bus accessible by the MAC operator. The computing unit performs one or more computations associated with at least one element of a data array, the one or more computations being performed by the MAC operator and comprising, in part, a multiply operation of the input activation received from the data bus and a parameter received from the second memory bank.

Another innovative aspect of the subject matter described in this specification can be embodied in a computer-implemented method for accelerating tensor computations. The computer-implemented method includes, sending, by a first memory bank having a first data width, a first input activation in response to the first memory bank receiving a control signal from a first traversal unit, the first memory bank being disposed in a computing unit, and wherein the first input activation is provided by a data bus that is accessible by at least cell of the computing unit. The method may further include, receiving, by the at least one cell, one or more parameters from a second memory bank having a second data width that is larger than the first data width, and wherein the at least one cell comprises at least one multiply accumulate (“MAC”) operator. The method may still further include, performing, by the MAC operator, one or more computations associated with at least one element of a data array, wherein the one or more computations comprise, in part, a multiply operation of at least the first input activation accessed from the data bus and at least one parameter received from the second memory bank.

Another innovative aspect of the subject matter described in this specification can be embodied in a non-transitory computer-readable storage medium. The non-transitory computer-readable storage medium comprising instructions executable by one or more processors which, upon such execution, causes the one or more processors to perform operations comprising, sending, by a first memory bank having a first data width, a first input activation in response to the first memory bank receiving a control signal from a first traversal unit, the first memory bank being disposed in a computing unit, and wherein the first input activation is provided by a data bus that is accessible by at least cell of the computing unit. The performed operations may also include, receiving, by the at least one cell, one or more parameters from a second memory bank having a second data width that is larger than the first data width, and wherein the at least one cell comprises at least one multiply accumulate (“MAC”) operator. The performed operations may also further include, performing, by the MAC operator, one or more computations associated with at least one element of a data array, wherein the one or more computations comprise, in part, a multiply operation of at least the first input activation accessed from the data bus and at least one parameter received from the second memory bank.

The subject matter described in this specification can be implemented in particular embodiments so as to realize one or more of the following advantages. Using registers to keep track of memory address values allow a program to iterate deeply-nested loops with one instruction. A tensor accessible from narrow memory and wide memory units, in a single compute tile, is traversed based on memory address values retrieved from registers. Memory address values correspond to elements of the tensor. Tensor computations occur in individual compute tiles based on execution of deep loop nests. Computations can be distributed across multiple tiles. Computational efficiency is enhanced and accelerated based on distributing tensor computations for a multilayer neural network across several compute tiles. Tensors can be traversed and tensor computations can be performed with a reduced number of instructions.

The subject matter described in this specification can also be implemented in particular embodiments so as to realize other advantages. For example, by employing a memory hierarchy that couples a narrow low bandwidth memory that allows addressing flexibility to traverse a multi-dimensional array in any order with a high bandwidth wide memory, high utilization of the MAC operators can be achieved for DNN layers of very different dimensions and locality in computation can be maximally exploited.

Other implementations of this and other aspects include corresponding systems, apparatus, and computer programs, configured to perform the actions of the methods, encoded on computer storage devices. A system of one or more computers can be so configured by virtue of software, firmware, hardware, or a combination of them installed on the system that in operation cause the system to perform the actions. One or more computer programs can be so configured by virtue of having instructions that, when executed by data processing apparatus, cause the apparatus to perform the actions.

The details of one or more implementations of the subject matter described in this specification are set forth in the accompanying drawings and the description below. Other potential features, aspects, and advantages of the subject matter will become apparent from the description, the drawings, and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an example computation system.

FIG. 2 illustrates an example neural network compute tile.

FIG. 3 illustrates an example Tensor Traversal Unit (TTU) structure.

FIG. 4 illustrates an example architecture that includes a narrow memory unit providing input activations to one or more multiply accumulate (MAC) operators.

FIG. 5 illustrates an example architecture that includes an output bus providing output activations to the narrow memory unit of FIG. 2 and FIG. 4.

FIG. 6 is an example flow chart of process for performing tensor computations using the neural network compute tile of FIG. 2.

Like reference numbers and designations in the various drawings indicate like elements.

DETAILED DESCRIPTION

The subject matter described in this specification relates to a hardware computing system including multiple computing units configured to accelerate machine learning inference workloads of a neural network layer. Each computing unit of the hardware computing system is self-contained and can independently execute computations required by a given layer of a multi-layer neural network.

A neural network having multiple layers can be used to compute inferences. For example, given an input, the neural network can compute an inference for the input. The neural network computes this inference by processing the input through each of the layers of the neural network. In particular, the layers of the neural network each have a respective set of weights. Each layer receives an input and processes the input in accordance with the set of weights for the layer to generate an output.

Therefore, in order to compute an inference from a received input, the neural network receives the input and processes it through each of the neural network layers in order to generate the inference, with the output from one neural network layer being provided as input to the next neural network layer. Data inputs to a neural network layer, e.g., either the input to the neural network or the outputs of the layer below the layer in the sequence, to a neural network layer can be referred to as activation inputs to the layer.

In some implementations, the layers of the neural network are arranged in a sequence. In other implementations, the layers are arranged in a directed graph. That is, any particular layer can receive multiple inputs, multiple outputs, or both. The layers of the neural network can also be arranged such that an output of a layer can be sent back as an input to a previous layer.

The hardware computing system described in this specification can perform the computation of a neural network layer by distributing tensor computations across multiple compute tiles. A computation process performed within a neural network layer may include a multiplication of an input tensor including input activations with a parameter tensor including weights. The computation includes multiplying an input activation with a weight on one or more cycles and performing an accumulation of a products over many cycles.

A tensor is a multi-dimensional geometric object and example multi-dimensional geometric objects include matrices and data arrays. In general, a software algorithm is executed by a computing tile to perform tensor computations by processing a nested loop to traverse an N-dimensional tensor. In one example computational process, each loop may be responsible for traversing a particular dimension of the N-dimensional tensor. For a given tensor construct, a compute tile may require access to an element of a particular tensor to execute a plurality of dot product computations associated with the tensor. Computation occurs when an input activation provided by a narrow memory structure is multiplied with a parameter or weight provided by a wide memory structure. Because the tensor is stored in a memory, a set of tensor indices may require translation to a set of memory addresses. In general, a tensor traversal unit of a compute tile executes control operations that provide the index of each dimension associated with the tensor and order in which index elements are traversed to perform computations. Tensor computations end when multiplication results are written to an output bus and stored in memory.

FIG. 1 shows a block diagram of an example computing system 100 for accelerating tensor computations associated with deep neural networks (DNNs). The system 100 generally includes a controller 102, a host interface 108, an input/output (I/O) link 110, multiple tiles including a first tile set 112 and a second tile set 114, a classifier portion 116, and data buses identified in a bus map 118 (which is shown for clarity, but is not included in the system 100). Controller 102 generally includes data memory 104, instruction memory 106, and at least one processor configured to execute one or more instructions encoded in a computer readable storage medium. Instruction memory 106 may store one or more machine readable instructions that are executable by the one or more processors of controller 102. Data memory 104 may be any of a variety of data storage mediums for storing and subsequently accessing a variety of data relating to computations that occur within system 100.

Controller 102 is configured to execute one or more instructions relating to tensor computations within system 100, including instructions stored in instruction memory 106. In some implementations, data memory 104 and instruction memory 106 are volatile memory unit or units. In some other implementations, data memory 104 and instruction memory 106 are non-volatile memory unit or units. Data memory 104 and instruction memory 106 may also be another form of computer-readable medium, such as a floppy disk device, a hard disk device, an optical disk device, or a tape device, a flash memory or other similar solid state memory device, or an array of devices, including devices in a storage area network or other configurations. In various implementations, controller 102 may also be referenced or referred to as core manager 102.

As depicted, host interface 108 is coupled to I/O link 110, controller 102, and classifier portion 116. Host interface 108 receives instructions and data parameters from I/O link 110 and provides instructions and parameters to controller 102. In general, instructions can be provided to one or more devices in system 100 through instruction bus 124 (described below) and parameters can be provided to one or more devices in system 100 through ring bus 128 (described below). In some implementations, instructions are received by controller 102 from host interface 118 at an initial time and stored in instruction memory 106 for execution by controller 102 at a later time.

Classifier portion 116 is likewise coupled to controller 102 and tile 7 of second tile set 114. In some implementations, classifier portion 116 is implemented as a separate tile within the system 100. In alternative implementations, classifier portion 116 is disposed or located within controller 102 as a sub-circuit or sub-device of controller 102. Classifier portion 116 is generally configured to perform one or more functions on accumulated pre-activation values that are received as outputs of fully connected layers. Fully connected layers may be partitioned across the tiles in tile sets 112 and 114. Thus, each tile is configured to produce a subset of pre-activation values (i.e., linear outputs) which may be stored in a memory unit(s) of the tile. Classification results bus 120 provides a data path from classifier portion 116 to controller 102. Data that includes post-function values (i.e., results) are provided to controller 102 from classifier portion 116 via classification results bus 120.

Bus map 118 shows data buses that provide one or more inter-connected data communication paths between tiles of first tile set 112 and second tile set 114. Bus map 118 provides a legend for identifying a classification results bus 120, CSR/master bus 122, instruction bus 124, mesh bus 126, and ring bus 128 as depicted in FIG. 1. In general, a tile is a core component within the accelerator architecture of system 100 and is the focal point for tensor computations that occur in the system. Each tile is an individual computing unit that cooperates with other tiles in the system to accelerate computations across one or more layers of a multi-layer neural network. Although tiles in tile sets 112, 114 can share execution of tensor computations associated with a given instruction, an individual computing unit is a self-contained computational component configured to execute a subset of tensor computations independently relative other corresponding tiles within tile sets 112, 114.

CSR bus 122 is a single master multiple slave bus that enables controller 102 to transmit one or more instructions that set program configurations and read status registers associated with one or more tiles. CSR bus 122 may be connected in a single daisy chain configuration with one master bus segment and multiple slave bus segments. As shown in FIG. 1, CSR bus 122 provides communications coupling through a bus data path that connects tiles in tile sets 112, 114 and controller 102 in a ring to host interface 110. In some implementation, host interface 110 is the single master of the CSR bus ring and the entire CSR bus address space is memory mapped to a memory space in host interface 110.

CSR bus 122 may be used by host interface 110 to perform one or more operations including, for example, programming memory buffer pointers in controller 102 to enable controller 102 to begin fetching instructions from instruction memory 106, updating/programming various tile settings (e.g., coefficient tables for polynomial approximation calculations) that remain static during one or more computations, and/or loading/reloading firmware to classification portion 116. In one example, firmware reloads may include new functions to be applied to linear outputs (i.e., pre-activation values). Accordingly, every slave having access to CSR bus 122 will have a distinct node identifier (node ID) that is tied to the slave and identifies it. The node ID will be part of an instruction address and will be used, inspected or otherwise examined by the CSR slaves (i.e., controller 102, tiles 112, 114 and classifier 116) to determine whether the CSR packet is addressed to the slave.

In some implementations, one or more instructions can be transmitted by host interface 102 through controller 102. The instructions may, for example, be 32-bits wide with the first 7-bits including header information indicating the instruction address/destination that is to receive and execute the instructions. The first 7-bits of the header may contain data parameters that represent a particular node ID. Slaves (e.g., each tile) on the CSR bus ring may therefore inspect the header of the instruction to determine if the request by the master (host interface 110) was addressed to the tile inspecting the header. If the node ID of the header does not indicate that the destination is the inspecting tile, the inspecting tile will copy the input CSR instruction packet to the CSR bus input connected to the next tile for inspection by the next tile.

Instruction bus 124 originates from controller 102 and, similar to CSR bus 122, also provides communications coupling through a bus data path that connects tiles in tile sets 112, 114 in a ring back to controller 102. In one implementation, controller 102 broadcasts one or more instructions via instruction bus 124. The instructions that are broadcast by controller 102 may differ from the instructions provided via CSR bus 122. However, the manner in which a tile receives and/or consumes or executes the instruction received via bus 124 may be similar to the process for executing instructions received via CSR bus 122.

In one example, a header (i.e., a bitmap) of the instruction indicates, to a receiving tile, that the receiving tile needs to consume a particular instruction based on a bitmap associated with the instruction. The bitmap may have a particular width defined in terms of bits. The instruction is typically forwarded from one tile onto the next tile based on parameters of the instruction. In one implementation, the width of instruction bus 124 may be configured to be smaller than the size/width of the instruction. Thus, in such a configuration, transmission of the instructions will be over several cycles and bus stops of instruction bus 124 will have decoders to place instructions received at the tile in the appropriate target instruction buffer associated with that tile.

As described further below, the tiles in tile sets 112, 114 are generally configured to support two broad categories of instructions. The two broad categories may also be referred to as instruction types. The instruction types include a tensor operation (TensorOp) instruction and a direct memory access (DMAOp) instruction. In some implementations, DMAOp instructions have one or more specializations that are allowed to be concurrent. The one or more specializations may be referred to as DMAOp instruction subtypes or opcodes. In some cases, every unique and/or valid DMAOp instruction type/subtype tuple will have a separate instruction buffer within a particular tile.

At a particular tile of tiles 112, 114, the bus stop associated with instruction bus 124 will examine the header bitmap to determine the instruction type/substype. The instruction may be received by the tile and subsequently written to an instruction buffer of the tile prior to execution of the instruction by the tile. The instruction buffer of the tile in which the instruction is written to may be determined by the type and subtype indicator/field of the instruction. The instruction buffers may include a first-in first-out (FIFO) control scheme that prioritizes consumption of one or more related instructions. Thus, under this FIFO control scheme, instructions of the same type/subtype will always be executed in the order in which the instruction arrived on the instruction bus.

The different instruction buffers within a tile are the TensorOp instruction buffers and the DMAOp instruction buffers. As indicated above, instruction types include the TensorOp instruction and the DMAOp instruction. With regard to DMAOp instructions, instruction subtypes (indicating a ‘write-to’ buffer location) include the following: 1) mesh inbound instruction buffer; 2) mesh outbound instruction buffer; 3) narrow-wide DMA instruction buffer; 4) wide-narrow DMA instruction buffer; and 5) ring bus DMA instruction buffer. These buffer locations will be described in more detail below with reference to FIG. 2. Wide and narrow designations are used throughout the specification and generally refer to an approximate size in width (bits/bytes) of one or more memory units. As used herein, “narrow” may refer to one or more memory units each having a size or width of less than 16-bits and “wide” may refer to one or more memory units each having a size or width or less than 64-bits.

Mesh bus 126 provides a data communications path that is distinct from CSR bus 122, instruction bus 124, and ring bus 128 (described below). As depicted in FIG. 1, mesh bus 126 provides a communications path that couples or connects each tile to its corresponding neighbor tile in both the X and Y dimensions. In various implementations, mesh bus 126 may be used to transport input activation quantities between one or more narrow memory units in adjacent tiles. As shown, mesh bus 126 does not allow direct forwarding of input activation data to non-adjacent tiles.

In various implementations, mesh bus 126 and the various tiles connected via mesh bus 126 may have the following configuration. Four corner tiles of the mesh have two outbound ports and two inbound ports. Four edge tiles of the mesh have three inbound ports and three outbound ports. All non-edge, non-corner tiles have four inbound ports and four outbound ports. In general, given an example N x N tile layout, edge tiles are tiles with only three neighbor tiles while corner tiles are tiles with two neighbor tiles. Regarding data flow methodology via mesh bus 126, in general, every input activation that arrives via mesh bus 126 for a particular tile must be committed to one or more narrow memory units of the tile. Moreover, for tile configurations that have fewer than four inbound ports, DMAOp instructions may write zero values to the locations in the tile's narrow memory instead of waiting for data on an absent input port. Likewise, for tile configurations that have fewer than four outbound ports, DMAOp instructions will not execute the narrow memory reads and port writes related to transfers for any absent ports.

In some implementations, a location or address of a narrow memory unit(s) that a particular input activation will be written to, or read from, will be generated by a Tensor Traversal Unit (hereinafter “TTU”) based on inbound/outbound DMAOp provided via mesh bus 126. An inbound DMAOp and an outbound DMAOp may be executed concurrently and any required synchronization will be managed through sync flag control schemes administered by controller 102. TTUs are described in further detail below with reference to FIG. 2 and FIG. 3.

Ring bus 128 originates from controller 102 and, similar to CSR bus 122 and instruction bus 124, also provides communications coupling through a bus data path that connects tiles 112, 114 in a ring back to controller 102. In various implementations, ring bus 128 generally connects or couples all wide memory units (described in more detail below with reference to FIG. 2) in all tiles 112, 114. Thus, a payload width of ring bus 128 corresponds to the width of the wide memory units disposed within each tile of tile sets 112, 114. As discussed above, ring bus 128 also includes a bitmap header indicating the tiles that need to consume payload data comprising instructions or parameters communicated via ring bus 128.

With regard to data (i.e., payload) received at a particular tile via ring bus 128, in response to receiving the information, each tile will zero (i.e., clear out) position data indicated in the bitmap header that is unique to the receiving tile before forwarding the data on to another tile. Hence, when the header bitmap has no remaining bit set data indicating a particular tile that is to receive the payload, forwarding of the payload to another tile will stop. Payload data generally refers to activations and weights used by one or more tiles during tensor computations performed based on execution of deeply nested loops.

In some implementations, controller 102 may be described as being a part of ring bus 128. In one example, for DMAOp instructions executed within a particular tile, controller 102 may be used to pop the data/payload from ring bus stops and forward the payload to a ring bus stop in a next tile in the ring. Controller 102 may also cause the payload data to be committed to one or more wide memory units of the tile if such action is required by instructions in the bitmap header. The address of the one or more wide memory units to which the data needs to be written may be generated by DMAOp instructions within the particular tile.

In various implementations, each tile of tile set 112, 114 can either be a producer of payload data or a consumer of payload data. When a tile is a producer of payload data the tile reads the data from one or more of its wide memory units and multicasts the data over ring bus 128 for consumption by one or more other tiles. When a tile is a consumer of payload data the tile receives and writes the data to one or more wide memory units within the tile and forwards the payload data for consumption by one or more other tiles. With regard to movement of payload data via ring bus 128, there typically will only be one producer/master of data on ring bus 128 at any given time. The DMAOp instruction execution order (e.g., FIFO control scheme) in all tiles will ensure there is only one producer/master of data on ring bus 128 at a given time.

In some implementations, controller 102 uses a sync flag control architecture to ensure there is only one producer/master of payload data on ring bus 128 at a given time. In one example, every write by a tile to a ring output will trigger an increment of the corresponding sync flag count. Controller 102 may examine the payload data to determine the number of data chunks or segments that comprise the payload. Controller 102 then monitors execution by the tile to ensure the expected number of data segments are forwarded and/or consumed by the tile before another tile executes in master mode.

An exception to ensuring there is only one producer/master of data on ring bus 128 at a given time occurs when there are local multicast groups connected via ring bus 128 that do not have an overlapping region on the ring bus. For example, tile 0 (master) may multicast (i.e., produce data) to a tile in Tile 0-Tile 3 grouping, while Tile 4 (master) may do the same to a tile in Tile 4-Tile 7 grouping. An important requirement of this dual master multicast methodology is that different multicast groups must not be allowed to see each other's data packets because packet overlap may occur and lead to one or more data computation errors.

As shown in FIG. 1, controller 102 provides a communications data path that couples or connects tiles in tile sets 112, 114 to I/O 110 and includes several core functions. The core functions of controller 102 generally include feeding one or more I/O input activations to tiles in tile sets 112, 114 feeding one or more input activations and parameters received from I/O 110 to the tiles, feeding one or more instructions received from I/O 110 to the tiles, sending I/O output activations to host interface 108, and serving as a ring stop for CSR bus 122 as well as ring bus 128. As described in more detail below, first tile set 112 and second tile set 114 each include multiple tiles that are used to perform one or more tensor computations that are executed based on a deep loop nest comprised of inner and outer loops.

System 100 generally operates as follows. Host interface 108 will provide one or more instructions to controller 102 that define direct memory access operations (DMAOp) that occur for a given computation. Descriptors associated with instructions fed to controller 102 will include information required by the controller to facilitate large scale dot product computations associated with multi-dimensional data arrays (tensors). In general, controller 102 receives, from host interface 108, input activations, tile instructions, and model parameters (i.e., weights) for executing tensor computations for a given layer of a neural network. Controller 102 may then cause the instructions to be multicast to tiles 112, 114 in a data flow manner defined by the instruction(s). As discussed above, tiles consuming an instruction may then initiate a broadcast of a new/subsequent instruction to another tile based on bitmap data in the instruction header.

With regard to data flow, input activations and parameters are transmitted to tiles of tile sets 112, 114 via ring bus 128. Each of tiles 112, 114 will store a subset of the input activations needed to compute a subset of output activations that are assigned to that particular tile. DMAOp instructions for a tile will cause the input activation to be moved from wide memory to narrow memory. Computation within a tile begins when required input activations, parameters/weights and computation instructions (TTU operations, memory addresses, etc.) are available in the tile. Computations occurring within a tile ends when MAC operators (described below) within a tile complete all dot product operations defined by the instruction set and pre-activation functions are applied to the results (i.e., output activations) of the multiplication operations.

Results of the one or more tensor computations include writing output activations of a compute layer to a narrow memory unit(s) of the tile performing the computation. For certain tensor computations, there will be a transfer of output edge activations to neighboring tiles via mesh bus 126. Transfer of output edge activations to neighboring tiles are required to compute output activations for a subsequent layer when computations span multiple layers. When computations for all layers are complete, a DMAOp will move final activations to classifier tile 116 through ring bus 128. Controller 102 will then read final activations from classifier tile 116 and execute a DMAOp to move the final activations to host interface 108. In some implementations, classifier portion 116 performs computations of an output layer (i.e., the last layer) of the NN. In other implementations, the output layer of the NN is one of classifier layer, a regression layer, or another layer type that is generally associated with neural networks.

FIG. 2 illustrates an example neural network (NN) compute tile 200. Generally, the example tile 200 may correspond to any of the tiles within first tile set 112 and second tile set 114 discussed above with reference to FIG. 1. In various implementations, compute tile 200 may also be referenced or referred to as computing unit 200. Each compute tile 200 is a self-contained computational unit configured to execute instructions independently relative other corresponding tiles within tile sets 112, 114. As discussed briefly above, each compute tile 200 executes two types of instructions, a TensorOp instruction and a DMAOp instruction. In general, each instruction type will include compute operations associated with deep loop nests and thus each instruction type will generally execute over multiple time epochs to ensure completion of all loop iterations.

As discussed in more detail below, the different instruction types are executed by independent control units within compute tile 200 that synchronize on data through sync flag controls that are managed within compute tile 200. The sync flag controls manage concurrency between executions of different instruction types within compute tile 200. Each compute operation associated with each instruction type will be executed in strict order of issuance (i.e., First-In First-Out). With regard to the two instruction types, TensorOP and DMAOp, there are no ordering guarantees between these different instruction types and each type is treated by compute tile 200 as a separate thread of control.

With regard to data flow constructs, compute tile 200 generally includes data path 202 and data path 205 that each provide a communications path for data flow into and out of compute tile 200. As described above, system 100 includes three distinct data bus structures that are laid out in a ring configuration—CSR bus 122, instruction bus 124, and ring bus 128. Referring to FIG. 2, data path 205 corresponds to instruction bus 124, while data path 202 generally corresponds to one of CSR bus 122 and ring bus 128. As shown, data path 202 includes a ring output 203 providing an output path for data leaving compute tile 200 and a ring input 204 providing an input path for data entering compute tile 200.

Compute tile 200 further includes a TensorOp control 206 including a TensorOp tensor traversal unit (TTU) 226 and a DMAOp control 208 including a DMAOp TTU 228. TensorOp control 206 generally manages writes to and reads from TensorOp TTU register 232 and administers traversal operations for execution by TensorOp TTU 226. Likewise, DMAOp control 208 generally manages writes to and reads from DMAOp TTU register 234 and administers traversal operations for execution by DMAOp TTU 228. TTU register 232 includes instruction buffers for storing one or more instructions comprising operations to be performed by TensorOp TTU 226 upon execution of the instructions by TensorOp control 206. Likewise, TTU register 234 includes instruction buffers for storing one or more instructions comprising operations to be performed by TTU 208 upon execution of the instructions by DMAOp control 208. As described further below, TTUs are used by compute tile 200 to traverse array elements of one or more tensors that generally reside in narrow memory 210 and wide memory 212.

In some implementations, certain instructions for execution by compute tile 200 arrive at the tile via data path 205 (i.e., a portion of instruction bus 124). Compute tile 200 will examine the header bitmap to determine the instruction type (TensorOp or DMAOp) and the instruction substype (read operation or write operation). Instruction(s) received by compute tile 200 are subsequently written to a particular instruction buffer depending on the instruction type. In general, instructions are received and stored (i.e., written to the buffer) prior to execution of the instruction by a component of compute tile 200. As shown in FIG. 2, the instruction buffers (i.e., TensorOp TTU register 232 and DMAOp TTU register 234) may each include a first-in first-out (FIFO) control scheme that prioritizes consumption (execution) of one or more related instructions.

As discussed briefly above, a tensor is a multi-dimensional geometric object and example multi-dimensional geometric objects include matrices and data arrays. An algorithm, including deeply nested loops, may be executed by compute tile 200 to perform tensor computations by iterating one or more nested loops to traverse an N-dimensional tensor. In one example computational process, each loop of the loop nest may be responsible for traversing a particular dimension of the N-dimensional tensor. As described herein, TensorOp control 206 generally administers one or more tensor operations that drive the sequence in which dimensional elements of a particular tensor construct are traversed and accessed to complete computations defined by the deep nested loops.

Compute tile 200 further includes a narrow memory 210 and a wide memory 212. Narrow and wide designations generally refer to a size in width (bits/bytes) of the memory units of narrow memory 210 and wide memory 212. In some implementations, narrow memory 210 includes memory units each having a size or width of less than 16-bits and wide memory 212 includes memory units each having a size or width or less than 32-bits. Generally, compute tile 200 receives input activations via data path 205 and DMA control 208 executes an operation to write the input activations into narrow memory 210. Likewise, compute tile 200 receives parameters (weights) via data path 202 and DMA control 208 executes an operation to write the parameters into wide memory 212. In some implementations, narrow memory 210 can include a memory arbiter typically used in shared memory systems to decide, for each memory cycle, which control device (e.g., TensorOp control 206 or DMAOp control 208) will be allowed to access that shared memory units of narrow memory 210.

Compute tile 200 further includes an input activation bus 216 and a MAC array 214 including multiple cells that each include a MAC operator 215 and a sum register 220. In general, MAC array 214 executes, using MAC operators 215 and sum registers 220 across multiple cells, tensor computations that include arithmetic operations relating to dot product computations. Input activation bus 216 provides a data path in which input activations are provided, by narrow memory 210, one-by-one for respective access by each MAC operator 215 of MAC array 214. Hence, based on the one-by-one broadcast of an input activation, a single MAC operator 215 of a particular cell will each receive an input activation. Arithmetic operations performed by the MAC operators of the MAC array 214 generally include multiplying an input activation provided by narrow memory 210 with a parameter accessed from wide memory 212 to produce a single output activation value.

During arithmetic operations, partial sums may be accumulated and stored in a corresponding, e.g., sum register 220, or written to wide memory 212 and re-accessed by a particular cell of MAC array 214 to complete follow-on multiply operations. The tensor computations can be described as having a first portion and second portion. The first portion is complete when multiply operations produce an output activation, for example, by completing a multiplication of an input activation and a parameter to generate the output activation. The second portion includes application of a non-linear function to an output activation and the second portion is complete when the output activation is written to narrow memory 210 after application of the function.

Compute tile 200 further includes an output activation bus 218, a non-linear unit (NLU) 222 comprising an output activation pipeline 224, an NLU control 238, and a reference map 230 that indicates a core attribute of a component in compute tile 200. Reference map 230 is shown for clarity, but is not included in the compute tile 200. Core attributes include whether a particular component is a unit, a storage device, an operator, a control device or a data path. In general, upon completion of the first portion of the tensor computations, output activations are provided from MAC array 214 to NLU 222 via output activation bus 218. After arrival at NLU 222, data specifying an activation function, received via activation pipeline 224 is applied to the output activations and the output activations are then written to narrow memory 210. In some implementations, output activation bus 218 includes at least one pipelined shift register 236 and completing the second portion of the tensor computations includes using a shift register 236 of activation bus 218 to shift output activations toward narrow memory 210.

With regard to dot product computations of, for example, two multi-dimensional data arrays, for a single compute tile 200, MAC array 214 provides robust single instruction multiple data (SIMD) functionality. SIMD generally means that all parallel units (multiple MAC operators 215) share the same instruction (based on the deep loop nest), but each MAC operator 215 executes the instruction on different data elements. In one basic example, adding the arrays [1,2,3,4] and [5,6,7,8] element-wise to obtain the array [6,8,10,12] in one cycle will typically require four arithmetic units to execute the operation on each element. By using SIMD, the four units can share the same instruction (e.g., “add”) and perform computations in parallel. Thus, system 100 and compute tile 200 provides enhanced acceleration and parallelism in tensor computations over prior methods.

In one example, and as described in more detail below, a single instruction can be provided by controller 102 to multiple compute tiles 200 (see tile sets 112, 114 of FIG. 1) for consumption by multiple MAC arrays 214. In general, neural network layers can include multiple output neurons and the output neurons can be partitioned such that tensor computations associated with a subset of output neurons can be assigned to a particular tile of tile sets 112, 114. Each tile of tile sets 112, 114 can then perform related tensor computations on different groups of neurons for a given layer. Compute tile 200 can therefore provide at least two forms of parallelism: 1) one form includes partitioning the output activations (corresponding to the subset of output neurons) amongst the multiple tiles of tile set 112, 114; and 2) another form includes simultaneous computation (with a single instruction) of multiple subsets of output neurons based on the partitioning amongst the tiles of tile sets 112, 114.

FIG. 3 illustrates an example Tensor Traversal Unit (TTU) structure 300 comprising four tensors to track each having a depth of eight. TTU 300 generally includes a counters tensor 302, a stride tensor 304, an init tensor 306, and a limit tensor 308. TTU 300 further includes an adder bank 310 and a tensor address index 312. As described above, a tensor is a multi-dimensional geometric object and to access an element of the tensor, an index of each dimension must be provided. Because the tensor is stored in narrow memory 210 and wide memory 212, a set of tensor indices must be translated to a set of memory addresses. In some implementations, translation of the indices to memory addresses is done by making the memory addresses a linear combination of the indices and reflecting addresses via tensor address index 312.

There is a TTU per control thread and there is a control thread per instruction type (TensorOP and DMAOp) in compute tile 200. Accordingly, as discussed above, there are two sets of TTUs in compute tile 200: 1) TensorOp TTU 226; and 2) DMAOp TTU 228. In various implementations, TensorOp control 206 will cause TTU 300 to load TensorOp TTU counter 302, limit 308, and stride values 304 at the beginning of a particular tensor operation and will not change the register values before the instruction is retired. Each of the two TTUs will need to generate an address for the following memory address ports in compute tile 200: 1) wide memory 212 address ports, and 2) narrow memory 210 which has four independently arbitrated banks that are presented as four address ports.

As discussed above, in some implementations, narrow memory 210 can include a memory arbiter typically used in shared memory systems to decide, for each memory cycle, which control device (e.g., TensorOp control 206 or DMAOp control 208) will be allowed to access shared memory resources of narrow memory 210. In one example, the different instruction types (TensorOp and DMAOp) are independent control threads that request for memory access that need to be arbitrated. When a particular control thread commits a tensor element to memory, the control thread increments the counters 302 of the tensor reference that was committed to memory.

In one example, when TensorOp control 206 executes an instruction for accessing a particular element of a tensor, TTU 300 can determine the address of the particular element of the tensor, such that the control 206 may access the storage, for example, narrow memory 210 to read data representing an activation value of the particular element. In some implementations, a program may include a nested loop and control 206 may execute an instruction to access an element of a two-dimensional array variable within the nested loop according to current index variable values associated with the nested loop.

TTU 300 may hold traversal state for up to X number of TTU rows for a given tensor(s) at the same time. Each tensor that resides concurrently in TTU 300 occupies a dedicated hardware tensor control descriptor. The hardware control descriptor can consist of X number TTU counters 302 per row position, stride 304, and limit registers 308 that support tensors having up to X number TTU counters per row dimensions. In some implementations, the number of rows and the number of counters per row can be different.

For a given position register, the final memory address is computed from an addition operation that includes adding position registers together. The base address is incorporated into counter 302. One or more adders are shared for tensor references that reside in the same memory. In one implementation, because there can only be a single load/store on any given port in a cycle, it will be a function of the loop nest control to ensure that multiple tensor references that reside in the same narrow or wide memory do not have their counters incremented on any given cycle. The use of registers for computing memory access address values including the determination of offset values are described in greater detail in patent application Ser. No. 15/014,265 titled “Matrix Processing Apparatus,” filed on Feb. 3, 2016, the entire disclosure of which is hereby expressly incorporated by reference in its entirety herein.

The following provides template parameters that may be used to instantiate a specialized TTU 300: 1) X Number of TTU Rows; 2) X Number of TTU Counters per Row; 3) X number of TTU Adder Units; 4) per TTU Row indicate shared Adder Reference; and 5) per Counter indicate X Counter Size [TTU][Row][Depth]. All TTU registers are architecturally visible. An address of a particular tensor element (i.e., tensor address 312) that needs to be accessed for the computation is the result of the addition of the counters. When an increment signal is issued from the control thread to a row of the TTU, TTU 300 executes a single cycle operation and increments an innermost dimension by a stride 304 of that dimension and propagates the rollover through all the depths.

In general, TTU 300 determines a status associated with one or more tensors. The status can include loop bound values, current loop index variable values, dimension multipliers for computing a memory address value, and/or program counter values for handling branch loop bounds. TTU 300 can include one or more tensor status elements and an arithmetic logic unit. Each of the tensor status elements may be a storage element, for example a register or any other suitable storage circuitry. In some implementations, the tensor status elements may be physically or logically arranged into different groups, as described in more detail in patent application Ser. No. 15/014,265.

FIG. 4 illustrates an example architecture that includes a narrow memory 210 broadcasting activations 404 via input bus 216 to one or more multiply accumulate (MAC) operators. Shift register 404 provides a shift functionality whereby activations 404 are sent out one at a time unto input bus 216 for receipt by one or more MAC operators 215 in a MAC cell 410. In general, MAC cells 410, including MAC operators 215, can be defined as compute cells that calculate a partial sum and, in some implementations, are configured to write a partial sum datum to output bus 218. As shown, cells 410 may consist of one or more MAC operators. In one implementation, the number of MAC operators 215 in a MAC cell 410 is referred to as the issue width of the cell. As an example, a dual issue cell refers to a cell with two MAC operators that can compute the multiplication of two activation values (from narrow memory 210) with two parameters (from wide memory 212) and perform an addition between the results of the two multipliers and the current partial sum.

As described above, input bus 216 is a broadcast bus that provides input activations to MAC operators 215 of the linear unit (i.e., MAC array 214). In some implementations, the same input is shared between all MAC operators 215. The width of input bus 216 must be wide enough to supply the broadcast inputs to the corresponding number of cells for a given MAC array 214. Consider the following example to illustrate the structure of input bus 216. When the number of cells in the linear unit equals four and the activation width equals eight bits, input bus 216 can be configured to provide up to four input activations every cycle. In this example, every cell in MAC array 214 will only access one out the four activations that are broadcast.

Based on TensorOp field settings of the instruction received by compute tile 200, cells of MAC array 214 may need to perform computations using the same input activation. This may be referred to as Zout partitioning within a cell of MAC array 214. Likewise, Zin partitioning within a cell occurs when cells of MAC array 214 need different activations to perform computations. In the former case, the single input activation is replicated four times and four activations read from narrow memory 210 are broadcast over four cycles. In the latter case, a read of narrow memory 210 is required every cycle. For the aforementioned example, TensorOp control 206 orchestrates this broadcast methodology based on execution of instructions received from controller 102.

FIG. 5 illustrates an example architecture that includes an output bus 218 for providing output activations to a narrow memory unit 210 of FIG. 2 and FIG. 4. In general, every MAC cell 215 of MAC array 214 in compute tile 200 computes a different output activation. However, with regard to an output feature array, in cases where output feature depth is less than the number of MAC cells 215 in a compute tile 200, cells may be grouped to form one or more cell groups. All MAC cells 215 in a cell group compute the same output (i.e., for an output feature map), however each cell only computes a subset of the outputs, corresponding to a subset of the Zin dimension. As a result, the output of a MAC cell 215 is now a partial sum, not the final linear output. In some implementation, NLU 222 will aggregate these partial sums into the final linear output based on a control signal provided to NLU 222 by NLU control 238.

As discussed above, output bus 218 is a pipelined shift register. In various implementations, when a first portion of the tensor computations end and TensorOp control 206 indicates (by executing an instruction) that a partial sum needs to be written out, there will be a parallel load of partial sums that are provided to output bus 218. The number of parallel loads will correspond to the number of MAC cells in compute tile 200. TensorOp control 206 will then cause the partial sum quantities to be shifted out and sent through the non-linear pipeline. In some implementations, there may be circumstances in which not all MAC cells in a tile are actually utilized to perform computations. In such a circumstance, not all partial sums shifted onto the output bus will be valid. In this example, TensorOp control 206 may provide a control signal to MAC array 214 to indicate the number of valid cells that should be shifted out. The parallel load quantities loaded to output bus 218 will still correspond to the number MAC cells in the compute tile, however, only valid values will be shifted out and committed to narrow memory 210.

FIG. 6 is an example flow chart of process 600 for performing tensor computations using the neural network compute tile 200 of FIG. 2. Process 600 begins at block 602 and narrow memory 210 of compute tile 200 sends (i.e., broadcasts) activations one-by-one on to input activation data bus 216. Activation values are stored in a narrow memory 210. Narrow memory 210 can be a collection of static random access memory (SRAM) banks that permit addressing to particular memory locations for accessing input quantities. The activations read from the narrow memory 210 are broadcast, via input activation bus 216, to linear cells of MAC array 214 (i.e., Linear Unit) that comprise multiple MAC operators 215 and sum registers 220. At block 604 of process 600, MAC operators 215 of compute tile 200 each receive two inputs—one input (an activation) is received from input activation bus 216; and another input (a parameter) is received from wide memory 212. Accordingly, the activations feed one of the inputs of each MAC operator 215 and each MAC operator 215 in the cells of MAC array 214 get their second multiplier input from wide memory 212.

At block 606 of process 600, MAC array 214 of compute tile 200 performs tensor computations comprising dot product computations based on elements of a data array structure accessed from memory. Wide memory 212 has a width in bits that is equal to the width of the linear unit (32-bits). The linear unit (LU) is thus a SIMD vector arithmetic logic unit (ALU) unit that receives data from a vector memory (i.e., wide memory 212). In some implementations, MAC operators 215 may also get the accumulator inputs (partial sums) from wide memory 212 as well. In some implementations, there is time sharing relative to the wide memory 212 port for reads and/or writes relating to the two different operands (parameters and partial sum). In general, to optimize area, wide memory 212 may have a limited number of ports. As a result, when there is a need to read an operand (e.g., a parameter) from wide memory 212 and write an operand (e.g., a partial sum) to wide memory 212 at the same time, a pipeline associated with a particular operand can be stalled.

At block 608, a compute cell (having MAC operator 215 and sum register 220) of compute tile 200 produces at least one output activation based on multiply operations performed by the MAC/compute cell. The result of MAC cell operations include either partial sums that are written back to wide memory (during partial sum arithmetic operations) or output activations that are sent to output bus 218. At block 610, NLU 222 of compute tile 200 applies a non-linear activation function to the output activations and writes then the activations to narrow memory 210. In some implementations, output bus 218 is a shift register and may accumulate a parallel load of results/output activations from the MAC operator 215, but shifts them out one at a time for application of the non-linear function and the write operation to narrow memory 210 of the same tile.

Embodiments of the subject matter and the functional operations described in this specification can be implemented in digital electronic circuitry, in tangibly-embodied computer software or firmware, in computer hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions encoded on a tangible non transitory program carrier for execution by, or to control the operation of, data processing apparatus. Alternatively or in addition, the program instructions can be encoded on an artificially generated propagated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, which is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. The computer storage medium can be a machine-readable storage device, a machine-readable storage substrate, a random or serial access memory device, or a combination of one or more of them.

The processes and logic flows described in this specification can be performed by one or more programmable computers executing one or more computer programs to perform functions by operating on input data and generating output(s). The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array), an ASIC (application specific integrated circuit), or a GPGPU (General purpose graphics processing unit).

Computers suitable for the execution of a computer program include, by way of example, can be based on general or special purpose microprocessors or both, or any other kind of central processing unit. Generally, a central processing unit will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a central processing unit for performing or executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices.

Computer readable media suitable for storing computer program instructions and data include all forms of non volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular inventions. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system modules and components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

Particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. For example, the actions recited in the claims can be performed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous. 

What is claimed is: 1.-20. (canceled)
 21. A system comprising multiple hardware computing units for accelerating inference computations for one or more layers of a neural network, each set of hardware computing units, comprising: a first computing unit configured to: receive instructions for performing inference computations for a first sequence of layers of the neural network, layer inputs for a first layer in the first sequence of layers, and a respective set of weights for each layer in the first sequence of layers; and perform inference computations for the first sequence of layers based on based on execution of a first loop nest to access at least the layer inputs and at least the respective set of weights for the first layer in the first sequence of layers; and a second computing unit configured to; receive instructions for performing inference computations for a second sequence of layers of the neural network, layer inputs for a first layer in the second sequence of layers, and a respective set of weights for each layer in the second sequence of layers; and perform inference computations for the second sequence of layers based on execution of a second loop nest to access at least the layer inputs and at least the respective set of weights for the first layer in the second sequence of layers.
 22. The system of claim 21, wherein execution of the first loop nest comprises: executing, by a processor of the first computing unit, a plurality of nested loops included in the first loop nest; and accessing, memory of the first computing unit, to retrieve data corresponding to elements of a tensor, wherein the data includes at least one of: layer inputs for a respective layer in the first sequence of layers or weights for the respective layer in the first sequence of layers.
 23. The system of claim 22, wherein the first computing unit comprises: at least one traversal unit that uses the first loop nest to access the elements of the tensor; wherein a structure of the first loop nest indicates a manner in which the at least one traversal unit traverses one or more dimensions of the tensor.
 24. The system of claim 21, wherein execution of the second loop nest comprises: executing, by a processor of the second computing unit, a plurality of nested loops included in the second loop nest; accessing, memory of the second computing unit, to retrieve data corresponding to elements of a tensor, wherein the data includes at least one of: layer inputs for a respective layer in the second sequence of layers or weights for the respective layer in the second sequence of layers.
 25. The system of claim 24, wherein the second computing unit comprises: at least one traversal unit that uses the second loop nest to access the particular elements of the tensor; wherein a structure of the second loop nest indicates a manner in which the at least one traversal unit traverses one or more dimensions of the tensor.
 26. The system of claim 21, wherein: the first sequence of layers of the neural network are neural network layers of a first layer type; and the second sequence of layers of the neural network are neural network layers of a second layer type that is different than the first layer type.
 27. The system of claim 21, further comprising: a data communications instruction bus configured to: receive one or more instructions from an external source; provide, to the first computing unit, the instructions for performing inference computations for the first sequence of layers; and provide, to the second computing unit, the instructions for performing inference computations for the second sequence of layers.
 28. The system of claim 27, further comprising: a data communications ring bus configured to: receive multiple inputs and multiple weights from an external source; provide, to the first computing unit, the layer inputs for the first layer in the first sequence of layers, and the respective set of weights for each layer in the first sequence of layers; and provide, to the second computing unit, the layer inputs for the first layer in the second sequence of layers, and the respective set of weights for each layer in the second sequence of layers.
 29. A method of accelerating inference computations for one or more layers of a neural network using a system comprising multiple hardware computing units, the method comprising: receiving, at a first computing unit, instructions for performing inference computations for a first sequence of layers of the neural network, layer inputs for a first layer in the first sequence of layers, and a respective set of weights for each layer in the first sequence of layers; performing, at the first computing unit, inference computations for the first sequence of layers based on based on execution of a first loop nest to access at least the layer inputs and at least the respective set of weights for the first layer in the first sequence of layers; receiving, at a second computing unit, instructions for performing inference computations for a second sequence of layers of the neural network, layer inputs for a first layer in the second sequence of layers, and a respective set of weights for each layer in the second sequence of layers; and performing, at the second computing unit, inference computations for the second sequence of layers based on execution of a second loop nest to access at least the layer inputs and at least the respective set of weights for the first layer in the second sequence of layers.
 30. The method of claim 29, wherein execution of the first loop nest comprises: executing, by a processor of the first computing unit, a plurality of nested loops included in the first loop nest; and accessing, memory of the first computing unit, to retrieve data corresponding to elements of a tensor, wherein the data includes at least one of: layer inputs for a respective layer in the first sequence of layers or weights for the respective layer in the first sequence of layers.
 31. The method of claim 30, wherein the first computing unit comprises: at least one traversal unit that uses the first loop nest to access the elements of the tensor; wherein a structure of the first loop nest indicates a manner in which the at least one traversal unit traverses one or more dimensions of the tensor.
 32. The method of claim 29, wherein execution of the second loop nest comprises: executing, by a processor of the second computing unit, a plurality of nested loops included in the second loop nest; accessing, memory of the second computing unit, to retrieve data corresponding to elements of a tensor, wherein the data includes at least one of: layer inputs for a respective layer in the second sequence of layers or weights for the respective layer in the second sequence of layers.
 33. The method of claim 32, wherein the second computing unit comprises: at least one traversal unit that uses the second loop nest to access the particular elements of the tensor; wherein a structure of the second loop nest indicates a manner in which the at least one traversal unit traverses one or more dimensions of the tensor.
 34. The method of claim 29, wherein: the first sequence of layers of the neural network are neural network layers of a first layer type; and the second sequence of layers of the neural network are neural network layers of a second layer type that is different than the first layer type.
 35. The method of claim 29, further comprising: receiving, at an instruction bus, one or more instructions from an external source, wherein the instruction bus is configured to provide data communications to the multiple hardware computing units; providing, to the first computing unit and by the instruction bus, the instructions for performing inference computations for the first sequence of layers; and providing, to the second computing unit and by the instruction bus, the instructions for performing inference computations for the second sequence of layers.
 36. The method of claim 35, further comprising: receiving, at a ring bus, multiple inputs and multiple weights from an external source, wherein the ring bus is configured to provide data communications to the multiple hardware computing units; providing, to the first computing unit and by the ring bus, the layer inputs for the first layer in the first sequence of layers, and the respective set of weights for each layer in the first sequence of layers; and providing, to the second computing unit and by the ring bus, the layer inputs for the first layer in the second sequence of layers, and the respective set of weights for each layer in the second sequence of layers.
 37. A non-transitory computer-readable storage medium having instructions stored thereon, which, when executed by a system comprising multiple hardware computing units, cause the system to perform operations comprising: receiving, at a first computing unit, instructions for performing inference computations for a first sequence of layers of the neural network, layer inputs for a first layer in the first sequence of layers, and a respective set of weights for each layer in the first sequence of layers; performing, at the first computing unit, inference computations for the first sequence of layers based on based on execution of a first loop nest to access at least the layer inputs and at least the respective set of weights for the first layer in the first sequence of layers; receiving, at a second computing unit, instructions for performing inference computations for a second sequence of layers of the neural network, layer inputs for a first layer in the second sequence of layers, and a respective set of weights for each layer in the second sequence of layers; and performing, at the second computing unit, inference computations for the second sequence of layers based on execution of a second loop nest to access at least the layer inputs and at least the respective set of weights for the first layer in the second sequence of layers.
 38. The computer-readable storage medium of claim 37, wherein execution of the first loop nest comprises: executing, by a processor of the first computing unit, a plurality of nested loops included in the first loop nest; and accessing, memory of the first computing unit, to retrieve data corresponding to elements of a tensor, wherein the data includes at least one of: layer inputs for a respective layer in the first sequence of layers or weights for the respective layer in the first sequence of layers.
 39. The computer-readable storage medium of claim 38, wherein the first computing unit comprises: at least one traversal unit that uses the first loop nest to access the elements of the tensor; wherein a structure of the first loop nest indicates a manner in which the at least one traversal unit traverses one or more dimensions of the tensor.
 40. The computer-readable storage medium of claim 37, wherein execution of the second loop nest comprises: executing, by a processor of the second computing unit, a plurality of nested loops included in the second loop nest; accessing, memory of the second computing unit, to retrieve data corresponding to elements of a tensor, wherein the data includes at least one of: layer inputs for a respective layer in the second sequence of layers or weights for the respective layer in the second sequence of layers. 